The transportation problem with exclusionary side constraints

نویسندگان

  • Dries R. Goossens
  • Frits C. R. Spieksma
چکیده

We consider the so-called Transportation Problem with Exclusionary Side Constraints (TPESC), which is a generalization of the ordinary transportation problem. We confirm that the TPESC is NP -hard, and we analyze the complexity of different special cases. For instance, we show that in case of a bounded number of suppliers, a pseudo-polynomial time algorithm exists, whereas the case of two demand nodes is already hard to approximate within a constant factor (unless P = NP ).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The transportation problem with exclusionary side constraints ∗ Dries Goossens † and Frits

We consider the so-called Transportation Problem with Exclusionary Side Constraints (TPESC), which is a generalization of the ordinary transportation problem. We determine the complexity status for each of two special cases of this problem, by proving NP-completeness, and by exhibiting a pseudo-polynomial time algorithm. For the general problem, we show that it cannot be approximated with a con...

متن کامل

Uncertainty in linear fractional transportation problem

In this paper, we study the linear fractional transportation problem with uncertain arameters. After recalling some definitions, concepts and theorems in uncertainty theory we present three approaches for solving this problem. First we consider the expected value of the objective function together with the expectation of satisfying constraints. Optimizing the expected value of the objective fun...

متن کامل

Maximal covering location-allocation problem with M/M/k queuing system and side constraints

  We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

متن کامل

Optimal Operation of Microgrids Under Demand Side Management

One of the major problem in the optimal operation of the power system is optimal operation of microgrid with regard to the Demand-side-management. From one side, demand-side-management programs  reduce the operating costs of the power system and on the other hand, the implementation of these programs requires a financial incentive policies. In this paper, optimal operation of microgrid with dem...

متن کامل

Using Ant Colony Optimization Metaheuristic in Forest Transportation Planning

Timber transportation is one of the most expensive activities in forest operations. Traditionally, the goal of forest transportation planning has been to find the combination of road development and harvest equipment placement that minimizes total harvesting and transportation costs. However, modern transportation problems are not driven only by economics of timber management, but also by multi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • 4OR

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2009